Abstract: According to the feature of strong vertex-distinguishing total coloring of circle graphs, the paper proposes an algorithm model, in the model there are two situations of three-four adjacent or three-five adjacent for any two adjacent points. Using the model to design a combinatorial construction algorithm, the algorithm is proved to get the strong vertex-distinguishing total chromatic number of circle graphs of given points. The experimental results show that this algorithm can effectively solve the problem of strong vertex-distinguishing total coloring of circle graphs.

Key words: strong vertex-distinguishing total coloring, strong vertex-distinguishing total chromatic number, combinatorial construction algorithm, circle graph